Missing Information Impediments to Learnability
نویسنده
چکیده
To what extent is learnability impeded when information is missing in learning instances? We present relevant known results and concrete open problems, in the context of a natural extension of the PAC learning model that accounts for arbitrarily missing information.
منابع مشابه
Learning Influence Functions from Incomplete Observations
We study the problem of learning influence functions under incomplete observations of node activations. Incomplete observations are a major concern as most (online and real-world) social networks are not fully observable. We establish both proper and improper PAC learnability of influence functions under randomly missing observations. Proper PAC learnability under the Discrete-Time Linear Thres...
متن کاملOn the Testability of Models with Missing Data
Graphical models that depict the process by which data are lost are helpful in recovering information from missing data. We address the question of whether any such model can be submitted to a statistical test given that the data available are corrupted by missingness. We present sufficient conditions for testability in missing data applications and note the impediments for testability when dat...
متن کاملA BAYESIAN APPROACH TO COMPUTING MISSING REGRESSOR VALUES
In this article, Lindley's measure of average information is used to measure the information contained in incomplete observations on the vector of unknown regression coefficients [9]. This measure of information may be used to compute the missing regressor values.
متن کاملImpediments to the Deployment of Knowledge Management Program in the Provincial Department of Education in Yazd
Impediments to the Deployment of Knowledge Management Program in the Provincial Department of Education in Yazd M. Zanjirchi, Ph.D. M. Hakkaaki A.R. Konjkaav Monfared F. Behniyaa To identify the impediments to the deployment of knowledge management program in the provincial department of education in Yazd, a questionnaire was completed by a carefully selected sample of 2...
متن کاملFeasible learnability of formal grammars and the theory of natural language acquisition
We propose to apply a complexity theoretic notion of feasible learnability called "polynomial learnability" to the evaluation of grammatical formalisms for linguistic description. Polynomial learnability was originally defined by Valiant in the context of boolean concept learning and subsequently generalized by Blumer et al. to infinitary domains. We give a clear, intuitive exposition of this n...
متن کامل